/*
 * @lc app=leetcode.cn id=961 lang=java
 *
 * [961] 重复 N 次的元素
 */

// @lc code=start
class Solution {
    public int repeatedNTimes(int[] nums) {
        for (int k = 1; k <= 3; ++k)
            for (int i = 0; i < nums.length - k; ++i)
                if (nums[i] == nums[i + k])
                    return nums[i];

        throw null;

    }
}
// @lc code=end
